Convex entropy decay via the Bochner–Bakry–Emery approach
نویسندگان
چکیده
منابع مشابه
A Convex Analysis Approach to Computational Entropy
This paper studies the notion of computational entropy. Using techniques from convex optimization, we investigate the following problems: 1. Can we derandomize the computational entropy? More precisely, for the computational entropy, what is the real difference in security defined using the three important classes of circuits: deterministic boolean, deterministic real valued, or (the most power...
متن کاملEntropy decay for interacting systems via the Bochner – Bakry – Émery approach ∗
We obtain estimates on the exponential rate of decay of the relative entropy from equilibrium for Markov processes with a non-local infinitesimal generator. We adapt some of the ideas coming from the Bakry–Emery approach to this setting. In particular, we obtain volume-independent lower bounds for the Glauber dynamics of interacting point particles and for various classes of hardcore models.
متن کاملEntropy Decay for Interacting Systems via the Bochner–bakry–emery Approach
Abstract. We obtain estimates on the exponential rate of decay of the relative entropy from equilibrium for Markov processes with a non-local infinitesimal generator. We adapt some of the ideas coming from the Bakry-Emery approach to this setting. In particular, we obtain volumeindependent lower bounds for the Glauber dynamics of interacting point particles and for various classes of hardcore m...
متن کاملScalable Convex Multiple Sequence Alignment via Entropy-Regularized Dual Decomposition
Multiple Sequence Alignment (MSA) is one of the fundamental tasks in biological sequence analysis that underlies applications such as phylogenetic trees, profiles, and structure prediction. The task, however, is NP-hard, and the current practice resorts to heuristic and local-search methods. Recently, a convex optimization approach for MSA was proposed based on the concept of atomic norm [23], ...
متن کاملDuality for almost convex optimization problems via the perturbation approach
We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2009
ISSN: 0246-0203
DOI: 10.1214/08-aihp183